Section: New Results
Strong chromatic index of planar graphs with large girth
Let be an integer. In [18] , we prove that every planar graph with maximum degree and girth at least is strong -edge-colorable, that is best possible (in terms of number of colors) as soon as contains two adjacent vertices of degree . This improves the best previous result when .